package LeetCode;

public class LC_617_MergeTwoBinaryTrees {

    public static void main(String[] args) {

    }

    public class Solution {
        TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if (t1 == null) return t2;
            if (t2 == null) return t1;
            int value = t1.val + t2.val;
            TreeNode node = new TreeNode(value);
            node.left = mergeTrees(t1.left, t2.left);
            node.right = mergeTrees(t1.right, t2.right);
            return node;
        }
    }

}